Scaling function and universal amplitude combinations for self-avoiding polygons
نویسندگان
چکیده
We analyse new data for self-avoiding polygons (SAPs), on the square and triangular lattices, enumerated by both perimeter and area, providing evidence that the scaling function is the logarithm of an Airy function. The results imply universal amplitude combinations for all area moments and suggest that rooted SAPs may satisfy a q-algebraic functional equation. PACS numbers: 05.50+q, 02.10.AB, 05.40.Fb, 61.41.+e
منابع مشابه
Scaling prediction for self-avoiding polygons revisited
We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the bicritical point. We also consider the shape of the critical curve near the bicritical point, which describes the crossover to the branched polymer phase. Our rece...
متن کاملSize and area of square lattice polygons
We use the finite lattice method to calculate the radius of gyration, the first and second area-weighted moments of self-avoiding polygons on the square lattice. The series have been calculated for polygons up to perimeter 82. Analysis of the series yields high accuracy estimates confirming theoretical predictions for the value of the size exponent, ν = 3/4, and certain universal amplitude comb...
متن کاملSelf-avoiding walks and polygons on the triangular lattice
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monome...
متن کاملS ep 2 00 4 Self - avoiding walks and polygons on the triangular lattice
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monome...
متن کاملA parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of gyration to 100. Analysis of the resulting series yields very accurate estimates of the connective constant μ= 2.638 158 530 31(3) (biased) and the critical...
متن کامل